منابع مشابه
Admissible Strategies in Infinite Games over Graphs
We consider games played on finite graphs, whose objective is to obtain a trace belonging to a given set of accepting traces. We focus on the states from which Player 1 cannot force a win. We compare several criteria for establishing what is the preferable behavior of Player 1 from those states, eventually settling on the notion of admissible strategy. As the main result, we provide a character...
متن کاملStructural Information in Graphs: Symmetries and Admissible Relabelings∗
We study structural properties of preferential attachment graphs (with parameter m ≥ 1 giving the number of attachment choices that each new vertex makes) which intervene in two complementary algorithmic/statistical/information-theoretic problems involving the information shared between a random graph’s labels and its structure: in structural compression, we seek to compactly describe a graph’s...
متن کاملComplexity results on w-well-covered graphs
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G, the set of weight functions w such that G is w-well-covered is a vector space, denoted WCW (G). Let B be a complete bipartite induced subgraph of ...
متن کاملStructure of W 4 - immersion free graphs ?
We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth.
متن کاملParallel Suboptimal Heuristic Search for finding a w-admissible solution. Performance analysis
Discrete optimization problems are interesting due to their complexity and applications, particularly in robotics. In this paper, a parallel algorithm that allows finding solutions to these problems, is presented. Then, the modifications that can be applied to it to obtain a second parallel algorithm that finds suboptimal solutions, reducing computation time, are studied. The algorithms propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Representation Theory of the American Mathematical Society
سال: 2008
ISSN: 1088-4165
DOI: 10.1090/s1088-4165-08-00336-1